Timed patterns: TCOZ to timed automata

Abstract. The integrated logic-based modeling language, Timed Communicating Object Z (TCOZ), is well suited for presenting complete and coherent requirement models for complex real-time systems. However, the challenge is how to verify the TCOZ models with tool support, especially for analyzing timing properties. Specialized graph-based modeling technique, Timed Automata (TA), has powerful mechanisms for designing real-time models using multiple clocks and has well developed automatic tool support. One weakness of TA is the lack of high level composable graphical patterns to support systematic designs for complex systems. The investigation of possible links between TCOZ and TA may benefit both techniques. For TCOZ, TA’s tool support can be reused to check timing properties. For TA, a set of composable graphical patterns can be defined based on the semantics of the TCOZ constructs, so that those patterns can be re-used in a generic way. This paper firstly defines the composable TA graphical patterns, and then presents sound transformation rules and a tool for projecting TCOZ specifications into TA. A case study of a railroad crossing system is demonstrated

Optimization of real-time systems timing specifications

10.1109/RTCSA.2006.48|Proceedings - 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 200668-7

Faster verification of RTL-specified systems via decomposition and constraint extension

10.1109/RTSS.2006.23Proceedings - Real-Time Systems Symposium67-76PRSY

A language-based access control approach for component-based software applications

In this paper we study security in component-based software applications by looking at information leakage from one component to another through operation calls. We model components and security speci¿cations about con¿dentiality as regular languages. Then we provide a systematic way to construct an access control mechanism that not only guarantees all speci¿cations to be obeyed, but also allows each user to attain maximum permissive behaviors

Automatic debugging of real-time systems based on incremental satisfiability counting

10.1109/TC.2006.97IEEE Transactions on Computers557830-842ITCO

Adaptive runtime fault management for services in component-based software applications

To improve availability of each individual service, we propose a runtime con¿gurable fault management mecha nism (FMM) which detects deviations from given service speci¿cations by intercepting interface calls. When repair is necessary, FMM picks a repair action that incurs the best tradeoff between the success rate and the cost of repair. Considering that it is rather dif¿cult to obtain suf¿cient in formation about third party components during their early stage of usage, FMM is designed to be able to accumulate knowledge and adapts its capability accordingly

Runtime-coordinated scalable incremental checksum testing of combinational circuits

10.1109/RTCSA.2005.87Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications357-36